11 x 11 Domineering is Solved: The first player wins
نویسنده
چکیده
We have developed a program called MUDoS (Maastricht University Domineering Solver) that solves Domineering positions in a very efficient way. This enables the solution of known positions so far (up to the 10 × 10 board) much quicker (measured in number of investigated nodes). More importantly, it enables the solution of the 11 × 11 Domineering board, a board up till now far out of reach of previous Domineering solvers. The solution needed the investigation of 259,689,994,008 nodes, using almost half a year of computation time on a single simple desktop computer. The results show that under optimal play the first player wins the 11×11 Domineering game, irrespective if Vertical or Horizontal starts the game. In addition, several other boards hitherto unsolved were solved.
منابع مشابه
Perfectly Solving Domineering Boards
In this paper we describe the perfect solving of rectangular empty Domineering boards. Perfect solving is defined as solving without any search. This is done solely based on the number of various move types in the initial position. For this purpose we first characterize several such move types. Next we define 12 knowledge rules, of increasing complexity. Of these rules, 6 can be used to show th...
متن کاملWho Wins Domineering on Rectangular Boards?
Using mostly elementary considerations, we find out who wins the game of Domineering on all rectangular boards of width 2, 3, 5, and 7. We obtain bounds on other boards as well, and prove the existence of polynomial-time strategies for playing on all boards of width 2, 3, 4, 5, 7, 9, and 11. We also comment briefly on toroidal and cylindrical boards.
متن کاملNew results for Domineering from combinatorial game theory endgame databases
We have constructed endgame databases for all single-component positions up to 15 squares for Domineering. These databases have been filled with exact Combinatorial Game Theory (CGT) values in canonical form. We give an overview of several interesting types and frequencies of CGT values occurring in the databases. The most important findings are as follows. First, as an extension of Conway’s [8...
متن کاملWaiter-Client and Client-Waiter planarity, colorability and minor games
For a finite set X, a family of sets F ⊆ 2X and a positive integer q, we consider two types of two player, perfect information games with no chance moves. In each round of the (1 : q) Waiter-Client game (X,F), the first player, called Waiter, offers the second player, called Client, q + 1 elements of the board X which have not been offered previously. Client then chooses one of these elements w...
متن کاملThe Advantage of the Initiative
Recently, the list of solved two-person zero-sum games with perfect information has increased. The state of current knowledge is that many games are a win for the ®rst player, some games are draws, and only a few games are a win for the second player. For games with three outcomes (won, drawn, lost) a game is commonly de®ned as fair if the theoretical value of the game is drawn. For these games...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1602.05404 شماره
صفحات -
تاریخ انتشار 2016